Deflection Routing on a Torus is Monotone ?
نویسندگان
چکیده
Deflection Routing is proposed for all optical core switches because of the lack of optical memory. In Shortest-path Deflection Routing, switches attempt to forward packets along a shortest hop path to their destinations. Each link can send a finite number of packets per time-slot (the link capacity). Incoming packets have to be sent immediately to their next switch along the path. If the number of packets which require a link is larger than the link capacity, only some of them will use the link they ask for and the other ones have to be misdirected or deflected. We build the Markov chain which models a packet routing in an odd torus. We prove that this matrix is st-monotone. The proof is based on increasing sets as we consider a partial ordering on the state space based on the network topology.
منابع مشابه
Buckling of multi wall carbon nanotube cantilevers in the vicinity of graphite sheets using monotone positive method
In this paper, a monotone positive solution is studied for buckling of a distributed model of multi walled carbon nanotube (MWCNT) cantilevers in the vicinity of thin and thick graphite sheets subject to intermolecular forces. In the modeling of intermolecular forces, Van der Waals forces are taken into account. A hybrid nano-scale continuum model based on Lennard–Jones potential is applied to ...
متن کاملMonotone Periodic Orbits for Torus Homeomorphisms
Let f be a homeomorphism of the torus isotopic to the identity and suppose that there exists a periodic orbit with a non-zero rotation vector ( q , r q ). Then f has a topologically monotone periodic orbit with the same
متن کاملRouting without Flow Control Hot-Potato Routing Simulation Analysis
This paper presents a simulation analysis of the algorithm presented in “Routing without Flow Control,” by Busch, Herlihy and Wattenhoffer, 2001, [1]. The hot-potato routing algorithm is simulated using Rensselaer’s Optimistic Simulation System. The simulation uses a novel reverse computation approach to efficiently and optimistically parallelize the system simulation. In addition to simulating...
متن کاملDeflection routing in slotted self-routing networks with arbitrary topology - Communications, 2002. ICC 2002. IEEE International Conference on
A deflection routing algorithm that can be applied to a novel self-routing address scheme for networks with arbitrary topology is proposed. The proposed deflection routing algorithm can be implemented all-optically using bitwise optical logic gates. Besides the primary output link selection, alternate output link choices by a packet at each node in case of deflection are also encoded in the add...
متن کاملDeflection Routing Strategies for Optical Burst Switching Networks: Contemporary Affirmation of the Recent Literature
A promising option to raising busty interchange in system communication could be Optical Burst Switched (OBS) networks among scalable and support routing effective. The routing schemes with disputation resolution got much interest, because the OBS network is buffer less in character. Because the deflection steering can use limited optical buffering or actually no buffering thus the choice or de...
متن کامل